منابع مشابه
Convex piecewise-linear fitting
We consider the problem of fitting a convex piecewise-linear function, with some specified form, to given multi-dimensional data. Except for a few special cases, this problem is hard to solve exactly, so we focus on heuristic methods that find locally optimal fits. The method we describe, which is a variation on the K-means algorithm for clustering, seems to work well in practice, at least on d...
متن کاملnetwork optimization with piecewise linear convex costs
the problem of finding the minimum cost multi-commodity flow in an undirected and completenetwork is studied when the link costs are piecewise linear and convex. the arc-path model and overflowmodel are presented to formulate the problem. the results suggest that the new overflow model outperformsthe classical arc-path model for this problem. the classical revised simplex, frank and wolf and a ...
متن کاملThe sequential maximum angle convex cone (SMACC) endmember model
A new endmember extraction method has been developed that is based on a convex cone model for representing vector data. The endmembers are selected directly from the data set. The algorithm for finding the endmembers is sequential: the convex cone model starts with a single endmember and increases incrementally in dimension. Abundance maps are simultaneously generated and updated at each step. ...
متن کاملRobust Endmember detection using L1 norm factorization
Given this model, spectral unmixing and endmember detection are the tasks of determining the endmembers and the proportions for every data point in the scene. Several endmember detection and spectral unmixing algorithms have been developed in the literature. However, the majority of these methods do not provide an autonomous way to estimate the number of endmembers and, thus, require the number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Geoscience and Remote Sensing
سال: 2010
ISSN: 0196-2892,1558-0644
DOI: 10.1109/tgrs.2010.2041062